Constrained Nets for Graph Matching and Other Quadratic Assignment Problems
نویسندگان
چکیده
منابع مشابه
Constrained Nets for Graph Matching and Other Quadratic Assignment Problems
Some time ago Durbin and Willshaw proposed an interesting parallel algorithm (the "elastic net'? for approximately solving some geometric optimization problems, such as the Traveling Salesman Problem. Recently it has been shown that their algorithm is related to neural networks of Hopfield and Tank, and that they both can be understood as the semiclassical approximation to statistical mechanics...
متن کاملConstrained neural approaches to quadratic assignment problems
In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good ...
متن کاملGraph Modeling for Quadratic Assignment Problems Associated with the Hypercube
In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associat...
متن کاملSolving Quadratic Assignment Problems
We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...
متن کاملResource constrained assignment problems
In many applications it is necessary to find a minimum weight assignment that satisfies one or several additional resource constraints. For example, consider the problem of assigning persons to jobs where each assignment utilizes at least two scarce resources and the resource utilization is dependent on the person and the type of task. A practical situation where the above might occur is a slau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 1991
ISSN: 0899-7667,1530-888X
DOI: 10.1162/neco.1991.3.2.268